#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#include <immintrin.h>
//#include <emmintrin.h>
#define ls(x) ((x)*2)
#define rs(x) ((x)*2+1)
#define fi first
#define se second
#define pii pair<int,int>
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define For(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define Rof(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define rep(i,  b) for(int i=1,i##end=b;i<=i##end;i++)
using namespace std;
const int N=1e6+5,base=999983,Mod=998244353;
//char buf[(1<<21)+5],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline void chmx(int &x,int y){(x<y)&&(x=y);}
inline void chmn(int &x,int y){(x>y)&&(x=y);}
inline void Add(int &x,int y){(x=x+y+Mod)%=Mod;}
inline int read(){
	int f=0,x=0;
	char ch=getchar();
	while(!isdigit(ch)){f|=(ch=='-');ch=getchar();}
	while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return f?-x:x;
}
void print(int n){
    if(n<0){
        putchar('-');
        n*=-1;
    }
    if(n>9) print(n/10);
    putchar(n%10+'0');
}
int n;
int a[N];
int lg[N];
int dp[2005][2005];
int mx[2005][2005];
signed main(){
	freopen("shung.in","r",stdin);
	freopen("shung.out","w",stdout);
	// ios::sync_with_stdio(false);
	// cin.tie(0); cout.tie(0);
	n=read();
	For(i,1,n) a[i]=read();lg[0]=-1;
	For(i,1,N-5)lg[i]=lg[i/2]+1;
	if(n<=2000){
		memset(dp,-0x3f,sizeof(dp));
		dp[0][0]=0;
		For(l,0,n)For(r,0,n)if(dp[l][r]>=0){
			 
			For(i,max(l,r)+1,n){
				if((a[i]>a[l]||!l)&&(a[i]<a[r]||!r)){
					dp[i][r]=max(dp[i][r],dp[l][r]+1);
					dp[l][i]=max(dp[l][i],dp[l][r]+1);
					break;
				}
				if(a[i]>a[l]||!l) dp[i][r]=max(dp[i][r],dp[l][r]+1);
				if(a[i]<a[r]||!r) dp[l][i]=max(dp[l][i],dp[l][r]+1);
			}
	//		cout<<dp[l][r]<<" "<<l<<" "<<r<<endl;
		}
		int ans=0;
		For(l,0,n)For(r,0,n)ans=max(ans,dp[l][r]);
		printf("%lld\n",ans);
		return 0;
	}int ans=0;
	int L=a[1],R=n+1,sum=0; 
	For(i,2,n){
		if(a[i]>L&&a[i]>=R)sum++,L=a[i];
		if(a[i]<R&&a[i]>=L) sum++,R=a[i];
		if(a[i]>L&&a[i]<R) sum++,L=a[i];
	}L=0,R=a[1];ans=max(ans,sum);sum=0;
	For(i,2,n){
		if(a[i]>L&&a[i]>=R)sum++,L=a[i];
		if(a[i]<R&&a[i]>=L) sum++,R=a[i];
		if(a[i]>L&&a[i]<R) sum++,L=a[i];
		
	}ans=max(ans,sum);sum=0;
	printf("%lld\n",ans);
#ifdef LOCAL
    Debug("\nMy Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif
	return 0;
}

